sufficient global optimality conditions for general mixed integer nonlinear programming problems
نویسندگان
چکیده
in this paper, some kkt type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (minpp) are established. we achieve this by employing a lagrange function for minpp. in addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are derived easily. numerical examples are also presented.
منابع مشابه
Sufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملOverview on Mixed Integer Nonlinear Programming Problems
Many optimization problems involve integer and continuous variables that can be modeled as mixed integer nonlinear programming (MINLP) problems. This has led to a wide range of applications, in particular in some engineering areas. Here, we provide a brief overview on MINLP, and present a simple idea for a future nonconvex MINLP solution technique.
متن کاملNew optimality conditions for multiobjective fuzzy programming problems
In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables. Based on a new $p$-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.
متن کاملGlobal Optimization of Mixed-Integer Nonlinear Problems
Two novel deterministic global optimization algorithms for nonconvex mixed-integer problems (MINLPs) are proposed, using the advances of the BB algorithm for noncon-vex NLPs Adjiman et al. (1998a). The Special Structure Mixed-Integer BB algorithm (SMIN-BB addresses problems with nonconvexities in the continuous variables and linear and mixed-bilinear participation of the binary variables. The G...
متن کاملSecond-order sufficient optimality conditions for local and global nonlinear programming
This paper presents a new approach to the suucient conditions of nonlinear programming. Main result is a suucient condition for the global optimality of a Kuhn-Tucker point. This condition can be veriied constructively, using a novel convexity test based on interval analysis, and is guaranteed to prove global optimality of strong local minimizers for suuciently narrow bounds. Hence it is expect...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
bulletin of the iranian mathematical societyجلد ۴۲، شماره ۵، صفحات ۱۲۳۷-۱۲۴۶
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023